Hybrid metaheuristics for stochastic constraint programming
نویسندگان
چکیده
منابع مشابه
Stochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and sto...
متن کاملStochastic Concurrent Constraint Programming
We present a stochastic version of Concurrent Constraint Programming (CCP), where we associate a rate to each basic instruction that interacts with the constraint store. We give an operational semantic that can be provided either with a discrete or a continuous model of time. The notion of observables is discussed, both for the discrete and the continuous version, and a connection between the t...
متن کاملStochastic Constraint Programming
Combinatorial optimisation problems often contain uncertainty that has to be taken into account to produce realistic solutions. One way of describing the uncertainty is using scenarios, where each scenario describes different potential sets of problem parameters based on random distributions or historical data. While efficient algorithmic techniques exist for specific problem classes such as li...
متن کاملA Two-Stage Chance-Constraint Stochastic Programming Model for Electricity Supply Chain Network Design
Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...
متن کاملHybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands
This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD). The problem is known to have a computational demanding objective function, which could turn to be infeasible when large instances are considered. Fast approximations of the objective function are therefore appealing because they would allow for an extended exploration of the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2014
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-014-9170-x